Theorem (Karmarkar, 1984)

Assume $n=d$. The interior point method solves any linear program with $L$-bit integer valued constraints in $O(n^{3.5} L)$ time.

Compare: Theorem (Khachiyan, 1979)